Extended Primitive Recursive Functions

نویسندگان

  • Patrizia Mentrasti
  • M. Protasi
چکیده

— In this paper we extend the notion of primitive recursive function to the case in which the domain is N* and the range is a subset oj N*. We give a rigorvus characterization oj tins class oj functions and show différences icith the classical primitive recursive functions. Résumé. — Dans cette note nous étendons la notion de f onction primitive recursive à tous les cas dans lesquels le domaine est iV* et le codomaine est contenu en N*. Nous donnons une caractérisation rigoureuse de cette classe de jonctions et montrons aussi des différences entre cette classe et celle des fonctions primitives récursives classiques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Choice and Uniformity in Weak Applicative Theories

We are concerned with first order theories of operations, based on combinatory logic and extended with the type W of binary words. The theories include forms of “positive” and “bounded” induction onW and naturally characterize primitive recursive and polytime functions (respectively). We prove that the recursive content of the theories under investigation (i.e. the associated class of provably ...

متن کامل

Primitive recursive functions versus partial recursive functions: comparing the degree of undecidability

Consider a decision problem whose instance is a function. Its degree of undecidability, measured by the corresponding class of the arithmetic (or Kleene-Mostowski) hierarchy hierarchy, may depend on whether the instance is a partial recursive or a primitive recursive function. A similar situation happens for results like Rice Theorem (which is false for primitive recursive functions). Classical...

متن کامل

Unary Primitive Recursive Functions

In this article, we will study certain reductions in the schemes that conform unary primitive recursive functions (i.e. primitive recursive functions of one argument) and we will extend some results previously researched by R. M. Robinson in [15]. Furthermore, we will introduce formal notation for unary primitive recursive functions. §

متن کامل

On the definability of functionals in Gödel's theory T

Gödel’s theory T can be understood as a theory of the simplytyped lambda calculus that is extended to include the constant 0N, the successor function S+, and the operator Rτ for primitive recursion on objects of type τ . It is known that the functions from non-negative integers to non-negative integers that can be defined in this theory are exactly the <ε0-recursive functions of non-negative in...

متن کامل

Term rewriting theory for the recursive functions

The termination of rewrite systems for parameter recursion, simple nested recursion and unnested multiple recursion is shown by using monotone interpretations both on the ordinals below the first primitive recursively closed ordinal and on the natural numbers. We show that the resulting derivation lengths are primitive recursive. As a corollary we obtain transparent and illuminating proofs of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ITA

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1982